Inventory routing in a warehouse: The storage replenishment routing problem

In warehouses, storage replenishment operations involve the transportation of items to capacitated item slots in forward area from reserve storage. These are later picked these as demand arises. While order picking constitutes majority warehouse operating costs, efficient management is important ensure availability for and decrease costs due replenishment, which might be particularly higher warehouses with fast-moving (e.g., e-commerce or retail distribution centers). this paper, we define routing problem a parallel-aisle warehouse, where carried out successive cycles time limits. The aim determine that will replenished route worker each cycle, so minimize total travel at start cycle they picked. We present complexity results on different variants show NP-hard general. Consequently, adapt heuristic approach based priori inspired by literature inventory problem. use randomly generated instances analyze effects methods skewness patterns performance, compare proposed benchmarks mimic practice.